Chebyshev Mappings of Finite Fields
نویسندگان
چکیده
For a fixed prime p, we consider the set of maps Z/pZ → Z/pZ of the form a 7→ Tn(a), where Tn(x) is the degree-n Chebyshev polynomial of the first kind. We observe that these maps form a semigroup, and we determine its size and structure.
منابع مشابه
On the Heuristic of Approximating Polynomials over Finite Fields by Random Mappings
The study of iterations of functions over a finite field and the corresponding functional graphs is a growing area of research with connections to cryptography. The behaviour of such iterations is frequently approximated by what is know as the Brent-Pollard heuristic, where one treats functions as random mappings. We aim at understanding this heuristic and focus on the expected rho length of a ...
متن کاملPost-buckling response of thin composite plates under end-shortening strain using Chebyshev techniques
In this paper, a method based on Chebyshev polynomials is developed for examination of geometrically nonlinear behaviour of thin rectangular composite laminated plates under end-shortening strain. Different boundary conditions and lay-up configurations are investigated and classical laminated plate theory is used for developing the equilibrium equations. The equilibrium equations are solved dir...
متن کاملThe Graph Structure of Chebyshev Polynomials over Finite Fields and Applications
We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and the expected value for the period and preperiod of iterating Chebyshev polynomials.
متن کاملChebyshev polynomials over finite fields and reversibility of -automata on square grids
Using number theory on function fields and algebraic number fields we prove results about Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional additive cellular automata on finite square grids. For example, we show that there are infinitely many primitive irreversible additive cellular automata on square grids when the base field has order two or three.
متن کاملChebyshev finite difference method for solving a mathematical model arising in wastewater treatment plants
The Chebyshev finite difference method is applied to solve a system of two coupled nonlinear Lane-Emden differential equations arising in mathematical modelling of the excess sludge production from wastewater treatment plants. This method is based on a combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The approach consists of reducing the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 119 شماره
صفحات -
تاریخ انتشار 2012